-
1 polynomial check string
Англо-русский словарь по компьютерной безопасности > polynomial check string
-
2 string
-
3 code
1) код; система кодирования || кодировать2) программа, текст программы, код || программировать, писать программу•-
absolute code
-
abstract code
-
address code
-
aeronautical code
-
algebraic code
-
alphanumeric code
-
alphameric code
-
answer-back code
-
antipollution code
-
area code
-
arithmetic code
-
authentication code
-
automatic code
-
balanced code
-
bar code
-
basic code
-
Baudot code
-
BCH code
-
best estimate code
-
binary code
-
binary-coded decimal code
-
binary decimal code
-
biphase code
-
bipolar code
-
block code
-
boiler code
-
Bose-Chaudhuri-Hocquenghem code
-
Building code
-
burst-correcting code
-
burst-detecting code
-
cable code
-
card code
-
carriage return code
-
chain code
-
channel code
-
character code
-
circulant code
-
close-packed code
-
code of practice
-
color code
-
command code
-
compiled code
-
complementary code
-
completion code
-
component code
-
computer code
-
concatenated code
-
condition code
-
constant ratio code
-
control code
-
convolutional code
-
copy codes
-
cyclic code
-
cyclic redundancy code
-
decimal code
-
destination code
-
diffuse code
-
direct code
-
dot-and-dash code
-
double-adjacent error-correcting code
-
electrical code
-
end line code
-
entropy code
-
equal-length code
-
equidistant code
-
erroneous code
-
error code
-
error-checking code
-
error-correcting code
-
error-detecting code
-
escape code
-
excess-N code
-
executable code
-
Fibonacci code
-
fixed-length code
-
fixed-weight code
-
flag code
-
format code
-
function code
-
genetic code
-
Gray code
-
group code
-
Hamming code
-
Hanning code
-
Hollerith code
-
Huffman code
-
identifying code
-
illegal code
-
instruction code
-
interleaved code
-
interrogation code
-
inverse code
-
kill line code
-
letter code
-
line ignore code
-
linear code
-
machine-language code
-
machine code
-
macro code
-
majority-decodable code
-
micro code
-
mnemonic code
-
m-out-of-n code
-
multiple-error correcting code
-
new common surface code
-
noise aeroport code
-
noise code
-
non-return-to-zero code
-
NRZI code
-
number code
-
numerical code
-
numeric code
-
n-unit code
-
object code
-
offset binary code
-
op code
-
parallel code
-
parity-check code
-
part-program code
-
P-code
-
perfect code
-
permutation code
-
personality code
-
polynomial code
-
positional code
-
position code
-
precedence code
-
prefix code
-
prime-residue error-correction code
-
proceed code
-
product code
-
pseudo code
-
pseudocyclic code
-
pseudonoise code
-
pseudoternary code
-
quasi-cyclic code
-
quasi-perfect code
-
quaternary code
-
rail code
-
raster code
-
recording code
-
rectangular bar code
-
recurrent code
-
redundant code
-
Reed-Muller code
-
Reed-Solomon code
-
reflected code
-
relative code
-
residue code
-
return code
-
return-to-zero code
-
rubout code
-
run-length code
-
run-length-limited code
-
sanitary code
-
self-checking code
-
serial code
-
sign code
-
simplex code
-
single error-correcting code
-
skeletal code
-
skip code
-
SMPTE time code
-
source code
-
specific code
-
standard code
-
state code
-
stop code
-
string code
-
studio code
-
symbolic code
-
systematic code
-
termination code
-
ternary code
-
time code
-
tool code
-
track code
-
transmission code
-
transparent code
-
trellis code
-
TTS code
-
twinned-binary code
-
two-frame code
-
type-bar flag code
-
typesetting code
-
unit disparity code
-
Universal Product code
-
unrail code
-
user identification code
-
user code
-
variable-length code
-
Wagner code
-
water code
-
weighted code
-
zero-disparity code
-
ZIP code
См. также в других словарях:
Longitudinal redundancy check — In telecommunication, a longitudinal redundancy check (LRC) or horizontal redundancy check is a form of redundancy check that is applied independently to each of a parallel group of bit streams. The data must be divided into transmission blocks,… … Wikipedia
Computation of CRC — Computation of a cyclic redundancy check is derived from the mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended, by the generator polynomial … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Quantum computer — A quantum computer is a device for computation that makes direct use of distinctively quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. In a classical (or conventional) computer, information is… … Wikipedia
Mathematics of CRC — Cyclic Redundancy Check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around … Wikipedia
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia
IP (complexity) — In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Goldwasser, et al. in 1985. An interactive proof system consists … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia